Geometric mean Newton’s method for simple and multiple roots

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the convergence of the secant method for simple and multiple roots

The secant method is one of the most popular methods for root finding. Standard text books in numerical analysis state that the secant method is super linear: the rate of convergence is set by the gold number. Nevertheless, this property holds only for simple roots. If the multiplicity of the root is larger than one, the convergence of the secant method becomes linear. This communication includ...

متن کامل

Numerical Elimination, Newton Method and Multiple Roots

Newton’s iteration has quadratic convergence for simple roots. We present a Newton-based iteration scheme with quadratic convergence for multiple roots of systems of analytic functions. This is a report on work in progress. 1. Newton Iteration, Approximate Roots and γ-Theorems 1.1. Newton Iteration. Let f : Cn → Cn be an analytic function. Newton’s method for solving f = 0 consists in approxima...

متن کامل

Improved logarithmic-geometric mean inequality and its application

In this short note, we present a refinement of the logarithmic-geometric mean inequality. As an application of our result, we obtain an operator inequality associated with geometric and logarithmic means.

متن کامل

Some weighted operator geometric mean inequalities

In this paper, using the extended Holder- -McCarthy inequality, several inequalities involving the α-weighted geometric mean (0<α<1) of two positive operators are established. In particular, it is proved that if A,B,X,Y∈B(H) such that A and B are two positive invertible operators, then for all r ≥1, ‖X^* (A⋕_α B)Y‖^r≤‖〖(X〗^* AX)^r ‖^((1-α)/2) ‖〖(Y〗^* AY)^r ‖^((1-α)/2) ‖〖(X〗^* BX)^r ‖^(α/2) ‖〖(Y...

متن کامل

On Constructing a Cubically Convergent Numerical Method for Multiple Roots

We propose the numerical method defined by xn+1 = xn − λ f(xn − μh(xn)) f ′(xn) , n ∈ N, and determine the control parameter λ and μ to converge cubically. In addition, we derive the asymptotic error constant. Applying this proposed scheme to various test functions, numerical results show a good agreement with the theory analyzed in this paper and are proven using Mathematica with its high-prec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2008

ISSN: 0893-9659

DOI: 10.1016/j.aml.2007.02.010